LILY-A Generator for Compiler Frontends

In this paper, LILY, a generator for compiler frontends is described. LILY uses a generator of minimal perfect hash functions, MPHF , to create small fast compilers

Parallelism in the Language, Natural

Natural is a language designed to provide a vehicle for the expression of abstract programming concepts clearly and precisely in a natural and mathematical form. The concept of parallelism can be expressed both explicitly and implicitly in the language, Natural. Due to relative freedom from side-effects and the use of a special value, undef, subexpressions can often be evaluated in parallel. The for and do statements both allow for a parallel mode of execution. A builtin functional, prlleval, creates functions which can evaluate their arguements in a parallel mode. In addition, the concept of module allows for the definition of and communication among processes

An Improved Algorithm for Generating Minimal Perfect Hash Functions

A minimal perfect hash function (MPHF) is a function from a set of M objects to the first M non-negative integers. MPHF\u27s are useful for the compact storage and fast retrieval of frequently used objects such as reserved words in a programming language or commonly employed words in a natural language. In this paper we improve on an earlier result and present an algorithm for generating MPHF\u27s with an expected time complexity proportional to M4. We also give a MPHF for the 256 most frequently used words in the English language

Survey of Routing Algorithms for Computer Networks

This thesis gives a general discussion of routing for computer networks, followed by an overview of a number of typical routing algorithms used or reported in the past few years. Attention is mainly focused on distributed adaptive routing algorithms for packet switching (or message switching) networks. Algorithms for major commercial networks (or network architectures) are reviewed as well, for the convenience of comparison

An Improved Exact Graph Coloring Algorithm

We present two algorithms for exact graph coloring of the vertex sequential with dynamic reordering of vertices variety. The first, W-DEG, is a straight-forward improvement on Korman’s original algorithm. The second, SWAP2, is a not so straight forward improvement on Korman’s algorithm and appears to offer the best performance of known exact graph coloring algorithms

Patents, Venture Capital, and Software Start-Ups

This paper analyzes the relation between the patenting behavior of startup firms and the progress of those firms through the venture capital cycle. Linking data relating to venture capital financing of software startup firms with data concerning the patents obtained by those firms, we find significant and robust positive correlations between patenting and several variables measuring the firm\u27s performance (including number of rounds, total investment, exit status, receipt of late stage financing, and longevity). The data also show that (1) only about one in four venture-backed software firms acquired even one patent during the period of the study; (2) patenting practices very considerably among the sub-sectors of the software industry; and (3) the relationship between patent metrics and firm performance depends less on the size of the patent portfolio than on the firm\u27s receipt of at least one patent

A Monte Carlo Analysis of the Mincycle Algorithm for Generating Minimal Perfect Hash Functions

In this paper, several minimal perfect hashing function generating methods are examined. One of them, the mincycle method by Sager is evaluated by the Monte Carlo method. The results are represented in graphs and tables

A Syntax-Directed Editor for Borland’s Turbo Pascal

This study details the design and implementation of the LSD program, a syntax-directed editor for use in editing the source code for Borland’s Turbo Pascal. LSD is a dual-mode editor which allows both traditional text editing and also grammar-based editing. LSD promotes better programming for novice users by allowing the user to edit the program with a graphical representation of a parse tree. A list of syntactically correct choices is displayed at each point where a choice must be made in the structure of the program. Since only these choices are available, no syntax errors are possible. For more advanced users, the ability to take an existing program and display the syntax tree will help show the underlying structure of the Pascal language grammar

A Color-Exchange Algorithm for Exact Graph Coloring

DEXCH, a color-exchange exact graph coloring algorithm is presented. On many classes of graphs, DEXCH can, in the mean, find the chromatic number of a graph considerably faster than the DSATUR algorithm. The improvement over DSATUR stems from the ability to reorganize the subset of colored vertices and to detect in certain instances the existence of a complete subgraph of cardinality equal to the number of colors used in the best coloring found so far. The mean improvement over DSATUR is greatest on high edge-density graphs attaining the value of 42% on random graphs of edge-density 0.7 on 64 vertices